Evaluation of thresholds for power mean-based and other divisor methods of apportionment

نویسندگان

  • Michael A. Jones
  • Jennifer M. Wilson
چکیده

For divisor methods of apportionment with concave up or concave down rounding functions, we prove explicit formulas for the threshold values—the lower and upper bounds for the percentage of population that are necessary and sufficient for a state to receive a particular number of seats. Among the rounding functions with fixed concavity are those based on power means, which include the methods of Adams, Dean, Hill-Huntington, Webster, and Jefferson. The thresholds for Dean’s and Hill-Huntington’s methods had not been evaluated previously. We use the formulas to analyze the behavior of the thresholds for divisor methods with fixed concavity, and compute and compare threshold values for Hill-Huntington’s method (used to apportion the U.S. House of Representatives).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A majorization comparison of apportionment methods in proportional representation

From the inception of the proportional representation movement it has been an issue whether larger parties are favored at the expense of smaller parties in one apportionment of seats as compared to another apportionment. A number of methods have been proposed and are used in countries with a proportional representation system. These apportionment methods exhibit a regularity of order, as discus...

متن کامل

Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study

Biproportional apportionment methods provide two-way proportionality in electoral systems where the electoral region is subdivided into electoral districts. The problem is to assign integral values to the elements of a matrix that are proportional to a given input matrix, and such that a set of rowand column-sum requirements are fulfilled. In a divisor-based method for biproportional apportionm...

متن کامل

A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein [CE14] has worst-case optimal running time but is complex, while the other [Puk14] is relatively sim...

متن کامل

Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems

When the seats in a parliamentary body are to be allocated proportionally to some given weights, such as vote counts or population data, divisor methods form a prime class to carry out the apportionment. We present a new characterization of divisor methods, via primal and dual optimization problems. The primal goal function is a cumulative product of the discontinuity points of the rounding rul...

متن کامل

A Note on Relaxed Divisor Methods

The purpose of this note is to add some important properties to the results obtained in [2]. Specifically, it is shown that (i) an apportionment for relaxed divisor methods remains unchanged over an interval and (ii) any relaxed divisor method approaches the Webster method as the house size increases.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Mathematical Social Sciences

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2010